k-Center Problems with Minimum Coverage
نویسندگان
چکیده
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirements to balance the workload of centerswhile allowing each center to cater to a spread of clients.We study three variants of this problem, all of which are shown to beNP-hard. In-approximation hardness and approximation algorithmswith factors equal or close to the best lower bounds are provided.Generalizations, including vertex costs and vertex weights, are also studied. © 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Asymmetric k-center with minimum coverage
In this paper we give approximation algorithms and inapproximability results for various asymmetric k-center with minimum coverage problems. In the k-center with minimum coverage problem, each center is required to serve a minimum number of clients. These problems have been studied by Lim et al. [Theor. Comput. Sci. 2005] in the symmetric setting. In the q-all-coverage k-center problem each cen...
متن کاملSolving the k-center Problem Efficiently with a Dominating Set Algorithm
We present a polynomial time heuristic algorithm for the minimum dominating set problem. The algorithm can readily be used for solving the minimum α-all-neighbor dominating set problem and the minimum set cover problem. We apply the algorithm in heuristic solving the minimum k-center problem in polynomial time. Using a standard set of 40 test problems we experimentally show that our k-center al...
متن کاملAnticipatory bound selection procedure (ABSP) for vertex K-center problem 0
Vertex k-center problem introduces the notion to recognize k locations as centers in a given network of n connected nodes holding the condition of triangle inequality. This paper presents an efficient algorithm that provides a better solution for vertex k-center problem. Anticipatory Bound Selection Procedure (ABSP) is deployed to find the initial threshold distance (or radius) and eradicating ...
متن کاملDelimitation of homogeneous regions in the UNIFESP/EPM healthcare center coverage area based on sociodemographic indicators.
CONTEXT The drawing up of adequate Public Health action planning to address the true needs of the population would increase the chances of effectiveness and decrease unnecessary expenses. OBJECTIVE To identify homogeneous regions in the UNIFESP/EPM healthcare center (HCC) coverage area based on sociodemographic indicators and to relate them to causes of deaths in 1995. DESIGN Secondary data...
متن کاملSet Coverage Problems in a One-Pass Data Stream
Finding a maximum coverage by k sets from a given collection (Max-k-Cover), finding a minimum number of sets with a required coverage (Partial-Cover) are both important combinatorial optimization problems. Various problems from data mining, machine learning, social network analysis, operational research, etc. can be generalized as a set coverage problem. The standard greedy algorithm is efficie...
متن کامل